Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("GRAMMAIRE LL(1)")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 9 of 9

  • Page / 1
Export

Selection :

  • and

EXTENSIONS SYNTAXIQUES DANS UN CONTEXTE LL(1).VIDART J.1974; ; S.L.; DA. 1974; PP. (150P.); BIBL. 5 P. 1/2; (THESE DOCT. 3E. CYCLE, SPEC. INF.; UNIV. SCI. MED.-INST. NATL. POLYTECH. GRENOBLE)Thesis

ON TOP-DOWN PARSING OF ALGOL 68+MEERTENS LGLT; VAN VLIET JC.1981; STICHT. MATH. CENT., AFD. INFORM.; ISSN 0376-4028; NLD; DA. 1981; NO 182; 19 P.; BIBL. 14 REF.Serial Issue

Practical LL (1)-based parsing of van Wijngaarden grammarsFISHER, A. J.Acta informatica. 1985, Vol 21, Num 6, pp 559-584, issn 0001-5903Article

CONTRIBUTION A L'ETUDE DE L'ANALYSE SYNTACTIQUE: APPLICATIONS A L'ETUDE DE L'ANALYSE SYNTACTIQUE DETERMINISTE DESCENDANTE = CONTRIBUTION TO THE STUDY OF PARSING: APPLICATIONS TO THE STUDY OF TOP-DOWN DETERMINISTIC PARSINGHUA THANH HUY.1982; ; FRA; DA. 1982; PAG. MULT.; 30 CM; BIBL. 18 P.; TH. 3E CYCLE: MATH. APPL./PARIS 6/1982Thesis

FROM LL-REGULAR TO LL(1) GRAMMARS: TRANSFORMATIONS, COVERS AND PARSINGNIJHOLT A.1982; R.A.I.R.O., INFORM. THEOR.; ISSN 0399-0540; FRA; DA. 1982; VOL. 16; NO 4; PP. 387-406; ABS. FRE; BIBL. 12 REF.Article

A COMPILER DEFINITION FACILITY BASED ON THE SYNTACTIC MACRO.CAMPBELL WR.1978; COMPUTER J.; G.B.; DA. 1978; VOL. 21; NO 1; PP. 35-41; BIBL. 9 REF.Article

SYPAC: UN SYSTEME EXPERIMENTAL DE CALCUL FORMEL EN PASCAL = SYPAC: AN EXPERIMENTAL SYSTEM OF FORMAL CALCULATION IN PASCALDI SCALA ROBERT MICHEL.1982; ; FRA; DA. 1982; 157 P.; 21 CM; BIBL. 58 REF.; TH. 3E CYCLE: INFORM./GRENOBLE 1/1982Thesis

The rapid generation of a class of software toolsINCE, D; WOODMAN, M.Computer journal (Print). 1986, Vol 29, Num 2, pp 151-160, issn 0010-4620Article

A simple P-complete problem and its language-theoretic representationsOKHOTIN, Alexander.Theoretical computer science. 2011, Vol 412, Num 1-2, pp 68-82, issn 0304-3975, 15 p.Article

  • Page / 1